Choiceless Ramsey Theory of Linear Orders
نویسندگان
چکیده
Together with the folklore result (using AC) that ψ 6 −→(ω, ω∗)2 this puts things into perspective. It is known that one can have very strong partition properties in models of ZF violating AC, consider for example Mathias’s result that ω −→ (ω)2 is consistent with ZF—cf. [6] or Martin’s discovery that AD implies ω1 −→ (ω1)1 which failed to be published by him (but cf. [2, 3, 4, 5]). We focus on linear orders of the form 〈2, <lex〉 for ordinals α and prove positive and negative partition relations, an example of the former is the following theorem.
منابع مشابه
A Ramsey theorem for partial orders with linear extensions
We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Sokić. As a bonus, our proof gives new arguments for these two results.
متن کاملRamsey theory and partially ordered sets
Over the past 15 years, Ramsey theoretic techniques and concepts have been applied with great success to partially ordered sets. In the last year alone, four new applications of Ramsey theory to posets have produced solutions to some challenging combinatorial problems. First, Kierstead and Trotter showed that dimension for interval orders can be characterized by a single ramsey trail by proving...
متن کاملAll those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
We prove the Ramsey property of classes of ordered structures with closures and given local properties. This generalises earlier results: the Nešetřil-Rödl Theorem, the Ramsey property of partial orders and metric spaces as well as the author’s Ramsey lift of bowtiefree graphs. We use this framework to give new examples of Ramsey classes. Among others, we show (and characterise) the Ramsey prop...
متن کاملThe model-theoretic complexity of automatic linear orders
Automatic structures are a subject which has gained a lot of attention in the “logic in computer science” community during the last fifteen years. Roughly speaking, a structure is automatic if its domain, relations and functions can be recognized by finite automata on strings or trees. In particular, such structures are finitely presentable. The investigation of automatic structures is largely ...
متن کاملDual Ramsey Theorem for Trees
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees. Galois connections between partial orders are used in formulating this theorem, while the abstract approach to Ramsey theory,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 34 شماره
صفحات -
تاریخ انتشار 2017